Fairness and Aggregation

Fairness and Aggregation: A Primal Decomposition Study

We examine the fair allocation of capacity to a large population of best-effort connections in a typical multiple access communication system supporting some bandwidth on demand processes. Because of stringent limitations on the signalling overhead and time available to transmit and process information, it is not possible to solve the allocation globally to obtain the optimally fair allocation ...

Intra-flow Fairness in Work-conserving Flow Aggregation

Currently, the Internet provides mainly best effort services. As multimedia applications emerge, a demand for quality of service guarantees follows. Packet-scheduling protocols, such as Virtual Clock and Weighted Fair Queuing, were designed to fulfill this demand by reserving network resources for each individual packet stream (also known as flows). This leads to a scalability problem in the co...

Throughput Fairness Using Packet Aggregation on 802.11g Networks

Throughput fairness in 802.11 environments have been widely studied for most of the researchers. Application protocols with small packet size get lesser throughput compared to large packet size protocols. In this paper, we propose fairness mechanism with selective packet aggregation based on type of protocol. The fairness mechanism affects packets that only belong to delay insensitive protocols...

Expanded HTA: Enhancing Fairness and Legitimacy

All societies face the need to make judgments about what interventions (both public health and personal medical) to provide to their populations under reasonable resource constraints. Their decisions should be informed by good evidence and arguments from health technology assessment (HTA). But if HTA restricts itself to evaluations of safety, efficacy, and cost-effectiveness, it risks being vie...

Correction: Expanded HTA: Enhancing Fairness and Legitimacy